Complexity and Mathematical Model for Flowshop Problem Subject to Different Types of Blocking Constraint
نویسنده
چکیده
Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem description and different blocking constraints definitions, complexity results for flowshop scheduling problems with mixed blocking constraints and a new type of blocking constraint (RCb*), are considered. A mathematical model is then proposed and numerical results are presented and discussed.
منابع مشابه
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملA Bi-objective Mathematical Model for Closed-loop Supply Chain Network Design Problem
In this paper, a bi-objective mixed-integer linear optimization model for Closed-loop Supply Chain Network Design Problem (CLSCND) is developed. The proposed model includes both the forward and reverse directions and includes different types of facilities, namely, manufacturing/remanufacturing centers, warehouses, and disassembly centers. The first objective function tried to minimize the total...
متن کاملA Fuzzy Based Mathematical Model for Vendor Selection and Procurement Planning with Multiple Discounts in the Presence of Supply Uncertainty
Supplier selection and material procurement planning are the most important issues in supply chain management. This decision is complicated when the buyers face with discount price schemes. In real situation, each supplier may apply different methods such as different types of discount schedules and various types of payment in order to increase market share. In this situation, buyers try to sel...
متن کاملMinimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environmen...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کامل